On the Chromatic Number of the Erdős-Rényi Orthogonal Polarity Graph
نویسندگان
چکیده
For a prime power q, let ERq denote the Erdős-Rényi orthogonal polarity graph. We prove that if q is an even power of an odd prime, then χ(ERq) 6 2 √ q + O( √ q/ log q). This upper bound is best possible up to a constant factor of at most 2. If q is an odd power of an odd prime and satisfies some condition on irreducible polynomials, then we improve the best known upper bound for χ(ERq) substantially. We also show that for sufficiently large q, every ERq contains a subgraph that is not 3-chromatic and has at most 36 vertices.
منابع مشابه
Independent Sets in Polarity Graphs
Given a projective plane Σ and a polarity θ of Σ, the corresponding polarity graph is the graph whose vertices are the points of Σ, and two distinct points p1 and p2 are adjacent if p1 is incident to p θ 2 in Σ. A well-known example of a polarity graph is the Erdős-Rényi orthogonal polarity graph ERq, which appears frequently in a variety of extremal problems. Eigenvalue methods provide an uppe...
متن کاملOn the Chromatic Number of Random Graphs
In this paper we consider the classical Erdős-Rényi model of random graphs Gn,p. We show that for p = p(n) ≤ n−3/4−δ, for any fixed δ > 0, the chromatic number χ(Gn,p) is a.a.s. , +1, or +2, where is the maximum integer satisfying 2( −1) log( −1) ≤ p(n−1).
متن کاملThe t-Improper Chromatic Number of Random Graphs
We consider the t-improper chromatic number of the Erdős-Rényi random graph Gn,p. The t-improper chromatic number χ(G) of G is the smallest number of colours needed in a colouring of the vertices in which each colour class induces a subgraph of maximum degree at most t. If t = 0, then this is the usual notion of proper colouring. When the edge probability p is constant, we provide a detailed de...
متن کاملEigenvalue bounds for independent sets
We derive bounds on the size of an independent set based on eigenvalues. This generalizes a result due to Delsarte and Hoffman. We use this to obtain new bounds on the independence number of the Erdős-Rényi graphs. We investigate further properties of our bounds, and show how our results on the Erdős-Rényi graphs can be extended to other polarity graphs.
متن کاملExtremal graphs without 4-cycles
We prove an upper bound for the number of edges a C4-free graph on q 2 + q vertices can contain for q even. This upper bound is achieved whenever there is an orthogonal polarity graph of a plane of even order q. Let n be a positive integer and G a graph. We define ex(n,G) to be the largest number of edges possible in a graph on n vertices that does not contain G as a subgraph; we call a graph o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 22 شماره
صفحات -
تاریخ انتشار 2015